(inverse Fourier transform)

См. также в других словарях:

• inverse Fourier transform — noun A mathematical operation that transforms a function for a discrete or continuous spectrum into a function for the amplitude with the given spectrum; an inverse transform of the Fourier transform …   Wiktionary

• Inverse Laplace transform — Contents 1 Mellin s inverse formula 2 Post s inversion formula 3 See also 4 References 5 Ext …   Wikipedia

• Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… …   Wikipedia

• Fourier transform on finite groups — In mathematics, the Fourier transform on finite groups is a generalization of the discrete Fourier transform from cyclic to arbitrary finite groups.DefinitionsThe Fourier transform of a function f : G ightarrow mathbb{C},at a representation ho,… …   Wikipedia

• Inverse scattering transform — In mathematics, the inverse scattering transform is a method for solving some non linear partial differential equations. It is one of the most important developments in mathematical physics in the past 40 years. The method is a non linear… …   Wikipedia

• Fractional Fourier transform — In mathematics, in the area of harmonic analysis, the fractional Fourier transform (FRFT) is a linear transformation generalizing the Fourier transform. It can be thought of as the Fourier transform to the n th power where n need not be an… …   Wikipedia

• Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …   Wikipedia

• Discrete Fourier transform (general) — See also: Fourier transform on finite groups This article is about the discrete Fourier transform (DFT) over any field (including finite fields), commonly called a number theoretic transform (NTT) in the case of finite fields. For specific… …   Wikipedia

• A derivation of the discrete Fourier transform — In mathematics, computer science, and electrical engineering, the discrete Fourier transform (DFT), occasionally called the finite Fourier transform, is a transform for Fourier analysis of finite domain discrete time signals. As with most Fourier …   Wikipedia

• Short-time Fourier transform — The short time Fourier transform (STFT), or alternatively short term Fourier transform, is a Fourier related transform used to determine the sinusoidal frequency and phase content of local sections of a signal as it changes over time. STFT… …   Wikipedia

• Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group …   Wikipedia